Single machine scheduling with controllable release and processing parameters

SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT

In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...

Single Machine Scheduling with Controllable Processing Times by submodular Optimization

In scheduling with controllable processing times the actual processing time of each job is to be chosen from the interval between the smallest (compressed or fully crashed) value and the largest (decompressed or uncrashed) value. In the problems under consideration, the jobs are processed on a single machine and the quality of a schedule is measured by two functions: the maximum cost (that depe...

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines

Single machine scheduling with controllable processing times to minimize total tardiness and earliness

0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.08.019 ⇑ Corresponding author. Tel.: +98 111 2197584; fax E-mail addresses: [email protected] (V. Kay com (I. Mahdavi), [email protected] (G In most deterministic scheduling problems job processing times are considered as invariable and known in advance. Single machine scheduling problem with controllable proces...

Single Machine Scheduling with Release Dates

We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other on a completiontime formulation. We show their equivalence by proving that a O(n logn) greedy algorithm leads to optimal solutions to both relax...